1553D - Backspace - CodeForces Solution

dp greedy strings two pointers *1500

Please click on ads to support us..

Python Code: 

q = int(input())
for _ in range(q):
    s = input()
    t = input()
    pointer_s, pointer_t = len(s)-1, len(t)-1
    same = 0
    while pointer_s >= 0 and pointer_t >= 0:
        if s[pointer_s] == t[pointer_t]:
            same += 1
            pointer_s -= 1
            pointer_t -= 1
        else:
            pointer_s -= 2
        if same == len(t):
            break
    if same == len(t):
        print("YES")
    else:
        print("NO")

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ll long long
#define ld long double
#define L "\n"
#define F first
#define S second
#define pb push_back

const int N=6e5+50;

ll n,m,x,y,z,k,a,b,d,cnt,cnt1,cnt2,l,r,sum,sum1,sum2,ans;
map<pair<char,ll>,vector<ll>>mp;
int main()
{
    IOS
    ll T = 1;
    cin >> T;
    while( T-- )
    {
        bool p=false;
        mp.clear();
        string s,ss;
        cin>>s>>ss;
        ll n=s.size(),m=ss.size();
        for(ll i=0 ; i<n ; i++)
        {
            mp[{s[i],i%2}].pb(i);
        }
        ll i=0,x=0;
        for( ; i<m ; i++)
        {
            auto it=lower_bound(mp[{ss[i],p}].begin(),mp[{ss[i],p}].end(),x);
            if(it==mp[{ss[i],p}].end())
                break;
            x=*it;
            p=!p;
        }
        if(i==m and (n-x)%2) {cout<<"YES\n";continue;}
        p=true;
        i=0;x=0;
        for( ; i<m ;  i++)
        {
            auto it=lower_bound(mp[{ss[i],p}].begin(),mp[{ss[i],p}].end(),x);
            if(it==mp[{ss[i],p}].end())
                break;
            x=*it;
            p=!p;
        }
        if(i==m and (n-x)%2) {cout<<"YES\n";continue;}
        no;
    }
}


Comments

Submit
0 Comments
More Questions

771. Jewels and Stones
1512. Number of Good Pairs
672. Richest Customer Wealth
1470. Shuffle the Array
1431. Kids With the Greatest Number of Candies
1480. Running Sum of 1d Array
682. Baseball Game
496. Next Greater Element I
232. Implement Queue using Stacks
844. Backspace String Compare
20. Valid Parentheses
746. Min Cost Climbing Stairs
392. Is Subsequence
70. Climbing Stairs
53. Maximum Subarray
1527A. And Then There Were K
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
318. Maximum Product of Word Lengths
448. Find All Numbers Disappeared in an Array
1155. Number of Dice Rolls With Target Sum
415. Add Strings
22. Generate Parentheses
13. Roman to Integer
2. Add Two Numbers
515. Find Largest Value in Each Tree Row
345. Reverse Vowels of a String
628. Maximum Product of Three Numbers
1526A - Mean Inequality
1526B - I Hate 1111
1881. Maximum Value after Insertion